One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2

Source URL: www.sandia.gov

• NP-complete problems
• Operations research
• Combinatorial optimization
• Parallel computing
• Mathematical optimization
• Parametric search
• Algorithm
• Dynamic programming
• Greedy algorithm
• Partition problem
• Distributed computing
• Approximation algorithm

Principal Partition and the Matroid Secretary Problem Jose´ A. Soto Department of Mathematics M.I.T.

Source URL: www.dim.uchile.cl

• Matroid theory
• Matroid
• Partition of a set
• Uniform matroid

CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗ Tim Roughgarden† April 25, 2010

Source URL: theory.stanford.edu

• NP-complete problems
• Planted clique
• Clique problem
• Clique
• Graph partition
• Maximum cut
• Probability distribution

Multi-Agent Ad Hoc Team Partitioning by Observing and Modeling Single-Agent Performance Etkin Baris Ozgul∗ , Somchaya Liemhetcharat† , and Kian Hsiang Low∗ ∗ Department of Computer Science, National University o

Source URL: somchaya.org

• NP-complete problems
• Partition problem
• Partition
• Reinforcement learning
• Algorithm
• Agent-based model
• Multi-agent system
• Graph partition
• Loop tiling

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Vehicle Routing for a Complex Waste Collection Problem Iliya Markov, Ecole Polytechnique Fédérale de Lausanne Sacha Varone, Haute Ecole de Gestion de Genève Michel Bierlaire, Ecole Polytechnique Fédérale de Lausanne

Source URL: www.strc.ch

• NP-complete problems
• Operations research
• Vehicle routing problem
• Travelling salesman problem
• Applied mathematics
• Mathematics
• Variable neighborhood search
• Partition problem
• Heuristic
• Simulated annealing
• Theoretical computer science

Functional Method We solve Problem 9.2 in Peskin–Schroeder. (a) We would like to evaluate the partition function Z = tr[e−βH ]

Source URL: hitoshi.berkeley.edu

Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction

Source URL: gauss.cs.ucsb.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph partition
• Hypergraph
• Graph traversal
• Breadth-first search
• Vertex
• Graph
• Shortest path problem
• Ear decomposition
• HopcroftKarp algorithm

The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio

Source URL: research.yahoo.com

• NP-complete problems
• Graph operations
• Graph coloring
• Dense subgraph
• Graph partition
• Community structure
• Tree
• Shortest path problem
• Graph
• Graph theory
• Theoretical computer science
• Mathematics

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003

Source URL: www.cs.berkeley.edu

• NP-complete problems
• Complexity classes
• Bin packing problem
• NP
• Subset sum problem
• Partition problem
• Vertex cover
• Integer
• 3-partition problem
• Theoretical computer science
• Mathematics
• Computational complexity theory